Efficient packet routing strategy in complex networks
نویسندگان
چکیده
منابع مشابه
An adaptive routing strategy for packet delivery in complex networks
We present an efficient routing approach for delivering packets in complex networks. On delivering a message from a node to a destination, a node forwards the message to a neighbor by estimating the waiting time along the shortest path from each of its neighbors to the destination. This projected waiting time is dynamical in nature and the path through which a message is delivered would be adap...
متن کاملEfficient Routing Strategy with Memory Information for Complex Networks
In this paper, we propose a new packet routing strategy that incorporates memory information for reducing congestion in communication networks. First, we study the conventional routing strategy which selects the paths for transmitting packets to destinations using the distance information and the dynamical information such as the number of accumulating packets at adjacent nodes. Then, we evalua...
متن کاملPheromone Static Routing Strategy for Complex Networks
(Dated: April 28, 2013) Abstract In this paper, we adopt the concept of pheromone to generate a set of static paths that can reach the performance of global dynamic routing strategy [Phys. Rev. E 81, 016113(2010)]. In the test stage, pheromone is dropped to the nodes by packets forwarded by the global dynamic routing strategy. After that, static paths are generated according to the density of p...
متن کاملEfficient Adaptive Routing Packet Transmission in Wireless Networks
Adaptive Routing is the progression of locating a clear path from a source point to a destination point across a network of nodes that could amend at any point. Mostly, Adaptive Routing algorithms make sure that data packets can move from one point in the network to another, even if one or more nodes in between are unavailable. To overcome the poor delay performance and complexities arise while...
متن کاملEfficient routing in packet-radio networks using link-state information
We present the source-tree adaptive routing (STAR) protocol, which we show through simulation experiments to be far more efficient than the Dynamic Source Routing (DSR) protocol, which has been shown to be one of the best performing on-demand routing protocols. A router in STAR communicates to its neighbors the parameters of its source routing tree, which consists of each link that the router n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2012
ISSN: 0378-4371
DOI: 10.1016/j.physa.2011.08.064